On Composing Concurrent Logic Processes
نویسندگان
چکیده
This paper discusses two methodological approaches for combining concurrent programs written in a modular way. The rst one is based on the composition of traces. It is intuitive and simple but evidences the need for a more abstract approach. The second one meets this need. It composes speciications written in a UNITY-like temporal logic, and rests on Abadi and Lamport's composition principle ((1]). The two methodologies are explained using the concurrent logic programming language Log but can actually be applied to other concurrent logic
منابع مشابه
Behaviours of Concurrent Systems
Concurrent systems and their behaviours are investigated. The: tehaviour of a system is understood as the set of processes1 which the system is capable to realize. The processes may be elementary (indivisible) or may consist of some components. Two ways of composing processes are considered: sequentially (one conponent is a continuation of another) and in parallel (the components are concurrent...
متن کاملComposing Concurrent Processes
The execution of concurrent programs written in many concurrent logic programming languages can be depicted as the parallel execution of processes accessing in some way a common global data structure. As an example, the cc family of languages ((9]) has as data structure a so-called store composed of constraints. It is accessed by means of the tell primitive, which adds the told constraint to th...
متن کاملConservation of CSP Noninterference Security under Concurrent Composition
In his outstanding work on Communicating Sequential Processes, Hoare has defined two fundamental binary operations allowing to compose the input processes into another, typically more complex, process: sequential composition and concurrent composition. Particularly, the output of the latter operation is a process in which any event not shared by both operands can occur whenever the operand that...
متن کاملComplexity of Compositional Model Checking of Computation Tree Logic on Simple Structures
Temporal Logic Model Checking is one of the most potent tools for the verification of finite state systems. Computation Tree Logic (CTL) has gained popularity because unlike most other logics, CTL model checking of a single transition system can be achieved in polynomial time. However, in most real-life problems, specially in distributed and parallel systems, the system consist of a set of conc...
متن کاملConcurrency Makes Simple Theories Hard
A standard way of building concurrent systems is by composing several individual processes by product operators. We show that even the simplest notion of product operators (i.e. asynchronous products) suffices to increase the complexity of model checking simple logics like HennessyMilner (HM) logic and its extension with the reachability operator (EF-logic) from PSPACE to nonelementary. In part...
متن کامل